Перегляд за автором "Santhakumaran, A.P."

Сортувати за: Порядок: Результатів:

  • Santhakumaran, A.P.; Ullas Chandran, S.V. (Algebra and Discrete Mathematics, 2012)
    For vertices u and v in a connected graph G = (V, E), the set ID[u, v] consists of all those vertices lying on a u−v longest path in G. Given a set S of vertices of G, the union of all sets ID[u, v] for u, v ∈ S, is denoted ...
  • Santhakumaran, A.P.; Athisayanathan, S. (Algebra and Discrete Mathematics, 2012)
    For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u-v path in G. A u-v path of length D(u, v) is called a u-v detour. For subsets A and B of V, the detour distance D(A, ...